AKC-Based Revocable ABE Schemes from LWE Assumption
نویسندگان
چکیده
منابع مشابه
Circuit-ABE from LWE: Unbounded Attributes and Semi-adaptive Security
We construct an LWE-based key-policy attribute-based encryption (ABE) scheme that supports attributes of unbounded polynomial length. Namely, the size of the public parameters is a fixed polynomial in the security parameter and a depth bound, and with these fixed length parameters, one can encrypt attributes of arbitrary length. Similarly, any polynomial size circuit that adheres to the depth b...
متن کاملEfficient Signature Schemes from R-LWE
Compared to the classical cryptography, lattice-based cryptography is more secure, flexible and simple, and it is believed to be secure against quantum computers. In this paper, an efficient signature scheme is proposed from the ring learning with errors (R-LWE), which avoids sampling from discrete Gaussians and has the characteristics of the much simpler description etc. Then, the scheme is im...
متن کاملIR-CP-ABE: Identity Revocable Ciphertext-Policy Attribute-Based Encryption for Flexible Secure Group-Based Communication
Ciphertext-Policy Attribute-Based Encryption (CP-ABE) is an access control mechanism over encrypted data and well suited for secure group-based communication. However, it also suffers from the following problem, i.e., it is impossible to build all desired groups. For example, if two group members have exactly the same attributes, how to construct a group including only one of the two members? O...
متن کاملRevocable ABE with Bounded Ciphertext in Cloud Computing
Revocable Attribute-Based Encryption (R-ABE) has received much concern recently due to its characteristic of capability on encrypting the Data, according to some attributes, whereas users can decrypt the ciphertexts if they own the credential of those attributes with ability to revoke the expired users. We propose a new practical Revocable Attribute Based Encryption which has a short ciphertext...
متن کاملProxy Re-Encryption Schemes with Key Privacy from LWE
Proxy re-encryption (PRE) is a cryptographic primitive in which a proxy can transform Alice’s ciphertexts into ones decryptable by Bob. Key-private PRE specifies an additional level of security, requiring that proxy keys leak no information on the identities of Alice and Bob. In this paper, we build two key-private PRE schemes: (1) we propose a CPA-secure key-private PRE scheme in the standard ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Security and Communication Networks
سال: 2020
ISSN: 1939-0122,1939-0114
DOI: 10.1155/2020/8834872